Nonlinear algorithms approach to split common solution problems
نویسندگان
چکیده
منابع مشابه
Nonlinear algorithms approach to split common solution problems
*Correspondence: [email protected] 2Department of Mathematics, National Kaohsiung Normal University, Kaohsiung, 824, Taiwan Full list of author information is available at the end of the article Abstract In this paper, we introduce some new iterative algorithms for the split common solution problems for equilibrium problems and fixed point problems of nonlinear mappings. Some examples ill...
متن کاملNonlinear Algorithms for a Common Solution of a System of Variational Inequalities, a Split Equilibrium Problem and Fixed Point Problems
In this paper, we propose an iterative algorithm for finding a common solution of a system of generalized equilibrium problems, a split equilibrium problem and a hierarchical fixed point problem over the common fixed points set of a finite family of nonexpansive mappings in Hilbert spaces. Furthermore, we prove that the proposed iterative method has strong convergence under some mild conditions...
متن کاملSolution of Nonlinear Obstacle Problems by Complementarity Algorithms
We discuss a nonlinear beam obstacle model defined by inequality constraints and differential equations with highly nonlinear and fourth order operators. An appropriate discrete approximation by the finite element method leads to a large finite-dimensional mixed nonlinear complementarity problem. We propose an interior-point algorithm for the solution of this complementarity problem. Some compu...
متن کاملWavelet Approach to Nonlinear Problems
We give via variational approach and multiresolution expansion in the base of compactly supported wavelets the explicit time description of four following problems: dynamics and optimal dynamics for some important electromechanical system, Galerkin approximation for beam equation, computations of Melnikov functions for perturbed Hamiltonian systems. We also consider wavelet parametrization in F...
متن کاملThe Ultimate Solution Approach to Intractable Problems
There is now strong belief that P 6= NP . This means that some very common problems cannot be solved efficiently under current and so called Von Neumann type computer architectures including parallel configurations. And, this will remain the case even in relatively low dimensions. What one may hope to achieve is the best possible solution given the available facilities within the allowed time. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fixed Point Theory and Applications
سال: 2012
ISSN: 1687-1812
DOI: 10.1186/1687-1812-2012-130